منابع مشابه
On a Hypergraph Matching Problem
Let H = (V,E) be an r-uniform hypergraph and let F ⊂ 2 . A matching M of H is (α,F)perfect if for each F ∈ F , at least α|F | vertices of F are covered by M . Our main result is a theorem giving sufficient conditions for an r-uniform hypergraph to have a (1− ,F)-perfect matching. As a special case of our theorem we obtain the following result. Let K(n, r) denote the complete r-uniform hypergrap...
متن کاملHypergraph modelling for geometric model fitting
In this paper, we propose a novel hypergraph based method (called HF) to fit and segment multi-structural data. The proposed HF formulates the geometric model fitting problem as a hypergraph partition problem based on a novel hypergraph model. In the hypergraph model, vertices represent data points and hyperedges denote model hypotheses. The hypergraph, with large and “data-determined” degrees ...
متن کاملHypergraph based geometric biclustering algorithm
0167-8655/$ see front matter 2012 Elsevier B.V. A http://dx.doi.org/10.1016/j.patrec.2012.05.001 ⇑ Corresponding author. E-mail addresses: [email protected] gmail.com (C.W. Yu), [email protected] (R.C.C. (H. Yan). In this paper, we present a hypergraph based geometric biclustering (HGBC) algorithm. In a high dimensional space, bicluster patterns to be recognized can be considered...
متن کاملIterative Packing for Demand and Hypergraph Matching
Iterative rounding has enjoyed tremendous success in elegantly resolving open questions regarding the approximability of problems dominated by covering constraints. Although iterative rounding methods have been applied to packing problems, no single method has emerged that matches the effectiveness and simplicity afforded by the covering case. We offer a simple iterative packing technique that ...
متن کاملLearning Hypergraph Labeling for Feature Matching
This study poses the feature correspondence problem as a hypergraph node labeling problem. Candidate feature matches and their subsets (usually of size larger than two) are considered to be the nodes and hyperedges of a hypergraph. A hypergraph labeling algorithm, which models the subset-wise interaction by an undirected graphical model, is applied to label the nodes (feature correspondences) a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Memoirs of the American Mathematical Society
سال: 2015
ISSN: 0065-9266,1947-6221
DOI: 10.1090/memo/1098